package lanqiao;

/**
 * @Project : AlgorithmLearning
 * @Package : LanQiao.PrepareForCompetition
 * @File : Q1463.java
 * @Author : WangRuoyu
 * @Date : 2023/3/29 10:16
 */

public class Q1463 {
    static long n = 2021041820210418L;
    static long res = 0;
    static long[] d = new long[10000];
    static int cnt = 0;

    public static void main(String[] args) {
        for (long i = 1; i * i <= n; ++i) {
            if (n % i == 0) {
                d[cnt++] = i;
                if (i != (n / i)) {
                    d[cnt++] = n / i;
                }
            }
        }

        for (int i = 0; i < cnt; ++i) {
            for (int j = 0; j < cnt; ++j) {
                for (int k = 0; k < cnt; ++k) {
                    if (d[i] * d[k] * d[j] == n) {
                        res++;
                    }
                }
            }
        }

        System.out.println(res);
    }
}

